A Low Energy Set-Associative I-Cache with Extended BTB
نویسندگان
چکیده
This paper proposes a low-energy instruction-cache architecture, called history-based tag-comparison (HBTC) cache. The HBTC cache attempts to re-use tag-comparison results for avoiding unnecessary way activation in setassociative caches. The cache records tag-comparison results in an extended BTB, and re-uses them for directly selecting only the hit-way which includes the target instruction. In our simulation, it is observed that the HBTC cache can achieve 62% of energy reduction, with less than 1% performance degradation, compared with a conventional cache.
منابع مشابه
Integrated I-cache Way Predictor and Branch Target Buffer to Reduce Energy Consumption
In this paper, we present a Branch Target Buuer (BTB) design for energy savings in set-associative instruction caches. We extend the functionality of a BTB by caching way predictions in addition to branch target addresses. Way prediction and branch target prediction are done in parallel. Instruction cache energy savings are achieved by accessing one cache way if the way prediction for a fetch i...
متن کاملIntegrated I cache Way Predictor and Branch Target Bu er to Reduce Energy Consumption
In this paper we present a Branch Target Bu er BTB design for energy savings in set associative in struction caches We extend the functionality of a BTB by caching way predictions in addition to branch target addresses Way prediction and branch target prediction are done in parallel Instruction cache energy savings are achieved by accessing one cache way if the way pre diction for a fetch is av...
متن کاملDynamic Tag-Check Omission: A Low Power Instruction Cache Architecture Exploiting Execution Footprints
This paper proposes an architecture for low-power direct-mapped instruction caches, called “history-based tag-comparison (HBTC) cache”. The HBTC cache attempts to detect and omit unnecessary tag checks at run time. Execution footprints are recorded in an extended BTB (Branch Target Buffer), and are used to know the cache residence of target instructions before starting cache access. In our simu...
متن کاملSimultaneous Way-footprint Prediction and Branch Prediction for Energy Savings in Set-associative Instruction Caches
Caches are partitioned into subarrays for optimal timing In a set associative cache if the way holding the data is known before an access only subarrays for that way need to be accessed Reduction in cache switching activities results in energy savings In this paper we propose to extend the branch pre diction framework to enable way footprint prediction The next fetch address and its way footpri...
متن کاملOmitting Cache Look-Up for High-Performance, Low-Power Microprocessors
In this paper, we propose a novel architecture for low-power direct-mapped instruction caches, called “historybased tag-comparison (HBTC) cache”. The cache attempts to reuse tag-comparison results for avoiding unnecessary tag checks. Execution footprints are recorded into an extended BTB (Branch Target Buffer). In our evaluation, it is observed that the energy for tag comparison can be reduced ...
متن کامل